Bounds on Maximal Families of Sets Not Containing Three Sets with A ∩ B ⊂ C, A ⊄ B
نویسندگان
چکیده
منابع مشابه
Bounds on maximal families of sets not containing three sets with A ∩ B ⊂ C , A 6 ⊂ B
There are a very large number of generalizations and analogues of this theorem. Here we will mention only some results where the conditions on F exclude certain configurations which can be expressed by inclusion only ∗School of Mathematics, Georgia Institute of Technology, Atlanta GA †The second author was supported by the Hungarian National Foundation for Scientific Research grant numbers NK06...
متن کاملSome results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملMaximal sets of numbers not containing k + 1 pairwise coprime
For positive integers k, n let f(n, k) be the maximal cardinality of subsets of integers in the interval < 1, n > , which don’t have k + 1 pairwise coprimes. The set E(n, k) of integers in < 1, n > , which are divisible by one of the first k primes, certainly does not have k + 1 pairwise coprimes. Whereas we disproved in [1] an old conjecture of Erdös ([4], [5], [6], [7]) by showing that the eq...
متن کاملUpper Bounds for B H [ G ] - Sets with Small
For g 2 and h 3, we give small improvements on the maximum size of a Bh[g]set contained in the interval {1, 2, . . . , N}. In particular, we show that a B3[g]-set in {1, 2, . . . , N} has at most (14.3gN)1/3 elements. The previously best known bound was (16gN)1/3 proved by Cilleruelo, Ruzsa, and Trujillo. We also introduce a related optimization problem that may be of independent interest.
متن کاملA Note on B 2 [ G ] Sets
Suppose g is a fixed positive integer. For N ≥ 2, a set A ⊂ Z ⋂ [1, N ] is called a B2[g] set if every integer n has at most g distinct representations as n = a + b with a, b ∈ A and a ≤ b. In this note, we introduce a new idea to give a small improvement to the upper bound for the size of such A when g is small.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2008
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-008-9090-8